High-performance numerical algorithms and software for structured total least squares
نویسندگان
چکیده
We present a software package for structured total least-squares approximation problems. The allowed structures in the data matrix are block-Toeplitz, block-Hankel, unstructured, and exact. Combination of blocks with these structures can be specified. The computational complexity of the algorithms is O(m), where m is the sample size. We show simulation examples with different approximation problems. Application of the method for multivariable system identification is illustrated on examples from the database for identification of systems DAISY. © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Software for structured total least squares problems: User’s guide
The package contains ANSI C software with Matlab mex interface for structured total least squares estimation problems. The allowed structures in the data matrix are block-Toeplitz, block-Hankel, unstructured, and noise free. Combinations of blocks with this structures can be specified. The computational complexity of the algorithms is O(m), where m is the sample size.
متن کاملBlock-Toeplitz/Hankel Structured Total Least Squares
A structured total least squares problem is considered in which the extended data matrix is partitioned into blocks and each of the blocks is block-Toeplitz/Hankel structured, unstructured, or exact. An equivalent optimization problem is derived and its properties are established. The special structure of the equivalent problem enables us to improve the computational efficiency of the numerical...
متن کاملRobust bearings-only tracking algorithm using structured total least squares-based Kalman filter
A nonlinear approach called the robust structured total least squares kalman filter (RSTLS-KF) algorithm is proposed for solving tracking inaccuracy caused by outliers in bearings-only multi-station passive tracking. In that regard, the robust extremal function is introduced to the weighted structured total least squares (WSTLS) location criterion, and then the improved Danish equivalent weight...
متن کاملApproximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficients that contain numerical noise. Our algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use singular value decomposition or structured total l...
متن کاملffects of Array Calibration Errors - Based Signal Copy Performance
AbslractThis paper studies the effect of array calibration errors on the performance of various direction 6nding @F) based signal copy algorithms. Unlike blind copy me€hods, this class of algorithms requires an estimate of the directions of arrival (DOA’s) of the signals in order to compute the copy weight vectors. Under the assumption that the observation time is sufficiently long, the followi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003